On the Complete Axiomatization for Prefix Iteration modulo Observation Congruence

نویسندگان

  • Taolue Chen
  • Tingting Han
  • Jian Lu
چکیده

Prefix iteration is a variation on the original binary version of the Kleene star operation P ∗Q, obtained by restricting the first argument to be an atomic action. Aceto and Ingólfsdóttir provided an axiom system for observation congruence over basic CCS with prefix iteration. However hitherto the only direct completeness proof given for such a system is very long and technical. In this paper, we provide a new proof for the completeness of the axiom system in [3], which is a considerable simplification comparing to the original proof. Thus the open problem to find a direct completeness proof is closed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ACompleteEquationalAxiomatization for Prefix Iteration with Silent Steps

Fokkink ((1994) Inf. Process. Lett. 52: 333–337) has recently proposed a complete equational axiomatization of strong bisimulation equivalence for MPAδ(Aτ ), i.e., the language obtained by extending Milner’s basic CCS with prefix iteration. Prefix iteration is a variation on the original binary version of the Kleene star operation p∗q obtained by restricting the first argument to be an atomic a...

متن کامل

A Complete Axiomatization for Prefix Iteration in Branching Bisimulation

This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.

متن کامل

A Complete Equational Axiomatization for Prefix Iteration

Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have...

متن کامل

A Complete Equational Axiomatization for Bpa with Preex Iteration

Preex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a nite equational axiomatization for this process algebra, and we prove that this axiomatization is complete with respect to strong bisimulation equivalence. This result is a mild generalization of a similar result in the setting of basic CCS in Fokkink (1994b). To obtain this completeness result, we...

متن کامل

Complete Axiomatization of Observation Congruence for Pmc Complete Axiomatization of Observation Congruence for Pmc

In AM93b] an asynchronous process algebra with multiple clocks, called PMC, was introduced and a complete axiomatization of strong bisimulation equivalence was given for a class of nite state processes. In this report we show how to extend the equational calculus so as to arrive at a complete axiomatization of observation congruence. Completeness is proven for the class of nite processes. With ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta Cybern.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2006